Co-Simmate: Quick Retrieving All Pairwise Co-Simrank Scores
نویسندگان
چکیده
Co-Simrank is a useful Simrank-like measure of similarity based on graph structure. The existing method iteratively computes each pair of Co-Simrank score from a dot product of two Pagerank vectors, entailing O(log(1/ǫ)n3) time to compute all pairs of Co-Simranks in a graph with n nodes, to attain a desired accuracy ǫ. In this study, we devise a model, Co-Simmate, to speed up the retrieval of all pairs of Co-Simranks to O(log2(log(1/ǫ))n) time. Moreover, we show the optimality of Co-Simmate among other hop-(uk) variations, and integrate it with a matrix decomposition based method on singular graphs to attain higher efficiency. The viable experiments verify the superiority of Co-Simmate to others.
منابع مشابه
Efficient Partial-Pairs SimRank Search for Large Networks
The assessment of node-to-node similarities based on graph topology arises in a myriad of applications, e.g., web search. SimRank is a notable measure of this type, with the intuition that “two nodes are similar if their in-neighbors are similar”. While most existing work retrieving SimRank only considers all-pairs SimRank s(⋆, ⋆) and single-source SimRank s(⋆, j) (scores between every node and...
متن کاملArrest Charges’ (Non)-Independence in Black and White Men An Extension and Application of SimRank to include Network Structure when Computing Black and White Men’s Arrest Charge Similarities
We extend the SimRank algorithm (Jeh and Widom 2002) to efficiently examine the similarity of charge pairs in a large dataset of men arrested in 2013. We compare computed SimRank scores of charge pairs within black and white arrestees and evaluate how these measures differ from the more traditional measure of similarity of Chi-squared residuals, which does not account for network structure. Our...
متن کاملDetection of Image Pairs Using Co-saliency Model
In this paper a method is presented to identify co-attention objects from an image pair. This method provides an effective way to predict human fixations within multi-images, and robustly highlight co-salient regions. This method generates the SISM by computing three visual saliency maps within each image. For the MISM computation, a comultilayer graph is introduced using a spatial pyramid repr...
متن کاملExtensions to Pairwise Similarity Calculation of Information Networks
We focus on extensions to the pairwise similarity calculation of information networks. By considering both inand out-link relationships, we propose Additiveand Multiplicative-SimRank to calculate the similarity score. Then we discuss the loop/cycles problem of information networks and propose a method to address this problem. Our extensive experimental results conducted on eight food web data s...
متن کاملEfficient SimRank-based Similarity Join Over Large Graphs
Graphs have been widely used to model complex data in many real-world applications. Answering vertex join queries over large graphs is meaningful and interesting, which can benefit friend recommendation in social networks and link prediction, etc. In this paper, we adopt “SimRank” to evaluate the similarity of two vertices in a large graph because of its generality. Note that “SimRank” is purel...
متن کامل